Neighbor discovery is a significant research topic in wireless sensor networks. After wireless sensor devices are deployed in specific\nareas, they attempt to determine neighbors within their communication range. This paper proposes a new Block design-based\nAsynchronous Neighbor Discovery protocol for sensor networks called BAND. We borrow the concept of combinatorial block\ndesigns for neighbor discovery. First, we summarize a practical challenge and difficulty of using the original block designs. To\naddress this challenge, we create a new block generation technique for neighbor discovery schedules and provide a mathematical\nproof of the proposed concept. A key aspect of the proposed protocol is that it combines two block designs in order to construct\na new block for neighbor discovery.We analyze the worst-case neighbor discovery latency numerically between our protocol and\nsome well-known protocols in the literature. Our protocol reveals that the worst-case latency ismuch lower than others. Finally, we\nevaluate the performance of BANDand existing representative protocols through the simulation study.The results of our simulation\nstudy show that the average and maximum latency of BAND is about 40% lower than that of existing protocols. Furthermore, BAND\nspends approximately 30% less energy than others during the neighbor discovery process.
Loading....